Finite DOL languages and codes

On the Ehrenfeucht Conjecture for DOL Languages

— Ehrenfeucht conjectured that each language L over a finite alphabet E possesses a test set, that is a finite subset F of L such that every two morphisms on E* agreeing on each string in F also agree on each string in L. We introducé the notion of déviation of a string with respect to a language and use it to give a sufficient condition for the existence of such a test set. Moreover, we prove ...

Ontological Blending in DOL

We introduce ontological blending as a method for combining ontologies. Compared with existing combination techniques that aim at integrating or assimilating categories and relations of thematically related ontologies, blending aims at creatively generating (new) categories and ontological definitions; this is done on the basis of input ontologies whose domains are thematically distinct but who...

Gray codes for reflectable languages

We classify a type of language called a reflectable language. We then develop a generic algorithm that can be used to list all strings of length n for any reflectable language in Gray code order. The algorithm generalizes Gray code algorithms developed independently for k-ary strings, restricted growth strings, and k-ary trees, as each of these objects can be represented by a reflectable langua...

Regular Languages and Finite Automata

Regular Languages and Finite Automata

In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying the behavior of the nervous systems. Following up on the ideas of McCulloch and Pitts, Kleene [3] wrote the first paper on finite automata and regular expressions. A finite automaton can be considered as the simplest machine model in that the machine has a finite memory; that is, the memory size is independent ...